Nearly Optimal Control Scheme for Discrete-Time Nonlinear Systems with Finite Approximation Errors Using Generalized Value Iteration Algorithm
نویسندگان
چکیده
In this paper, a new generalized value iteration algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. The idea is to use iterative adaptive dynamic programming (ADP) to obtain the iterative control law which makes the iterative performance index function reach the optimum. The generalized value iteration algorithm permits an arbitrary positive semi-definite function to initialize it, which overcomes the disadvantage of traditional value iteration algorithms. When the iterative control law and iterative performance index function in each iteration cannot be accurately obtained, a new design method of the convergence criterion for the generalized value iteration algorithm with finite approximation errors is established to make the iterative performance index functions converge to a finite neighborhood of the lowest bound of all performance index functions. Simulation results are given to illustrate the performance of the developed algorithm.
منابع مشابه
Theoretical and Numerical Analysis of Approximate Dynamic Programming with Approximation Errors
This study is aimed at answering the famous question of how the approximation errors at each iteration of Approximate Dynamic Programming (ADP) affect the quality of the final results considering the fact that errors at each iteration affect the next iteration. To this goal, convergence of Value Iteration scheme of ADP for deterministic nonlinear optimal control problems with undiscounted cost ...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملSolving infinite horizon optimal control problems of nonlinear interconnected large-scale dynamic systems via a Haar wavelet collocation scheme
We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...
متن کاملAdaptive dynamic programming-based optimal control of unknown nonaffine nonlinear discrete-time systems with proof of convergence
In this paper, a novel neuro-optimal control scheme is proposed for unknown nonaffine nonlinear discretetime systems by using adaptive dynamic programming (ADP) method. A neuro identifier is established by established RNN model, the ADP method is utilized to design the approximate optimal controller. Two neural networks (NNs) are used to implement the iterative algorithm. The convergence of the...
متن کاملOn congestion control for nonlinear discrete networks based on successive approximation approach
A successive approximation approach (SAA) is developed to obtain a new congestion controller for the nonlinear network control systems. By using the successive approximation approach, the original optimal control problem is transformed into a sequence of nonhomogeneous linear two-point boundary value (TPBV) problems. The optimal control law obtained consists of an accurate linear feedback term ...
متن کامل